5 research outputs found

    A FUZZY LOGIC CLASSIFICATION OF INCOMING PACKET FOR VOIP

    Get PDF
    The Voice over Internet Protocol (VoIP) technology is cheaper and does not need new infrastructure because it has availables in the global computer (IP) network. Unfortunately, transition from PSTN to VoIP networks have emerged new problems in voice quality. Furthermore, the transmission of voice over IP networks can generate network congestion due to weak supervision of the traffic incoming packet, queuing and scheduling. This congestion affects the Quality of Service (QoS) such as delay, packet drop and packet loss. Packet delay effects will affect the other QoS such as: unstable voice packet delivery, packet jitter, packet loss and echo. Priority Queuing (PQ) algorithm is a popular technique used in the VoIP network to reduce delays. But, the method can result in repetition. This recursive leads to the next queue starved. To solving problems, there are three phases namely queuing, classifying and scheduling. It will be applied to the fuzzy inference system to classify the queuing incoming packet (voice, video and text). To justify the research of the improved PQ algorithm be compared against the algorithm existing

    Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

    Get PDF
    Software Defined Networking (SDN) introduced network management flexibility that eludes traditional network architecture. Nevertheless, the pervasive demand for various cloud computing services with different levels of Quality of Service requirements in our contemporary world made network service provisioning challenging. One of these challenges is path selection (PS) for routing heterogeneous traffic with end-to-end quality of service support specific to each traffic class. The challenge had gotten the research community\u27s attention to the extent that many PSAs were proposed. However, a gap still exists that calls for further study. This paper reviews the existing PSA and the Baseline Shortest Path Algorithms (BSPA) upon which many relevant PSA(s) are built to help identify these gaps. The paper categorizes the PSAs into four, based on their path selection criteria, (1) PSAs that use static or dynamic link quality to guide PSD, (2) PSAs that consider the criticality of switch in terms of an update operation, FlowTable limitation or port capacity to guide PSD, (3) PSAs that consider flow variabilities to guide PSD and (4) The PSAs that use ML optimization in their PSD. We then reviewed and compared the techniques\u27 design in each category against the identified SDN PSA design objectives, solution approach, BSPA, and validation approaches. Finally, the paper recommends directions for further research
    corecore